On self-organizing sequential search heuristics
نویسندگان
چکیده
منابع مشابه
Self-Organizing Sequential Search Heuristics
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilistically. In this article,, we use amortization to analyze the heuristics in a worst-case sense; the relative merit of the heuristics in this analysis is different in t...
متن کاملOnline Algorithms for Self-Organizing Sequential Search - A Survey
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity result...
متن کاملSelf-Organizing Parallel Search Clusters
A number of methods have been proposed to increase the efficiency and effectiveness of peer-topeer searches. By controlling the topology of the peers, that is, the way in which nodes are organized in the network, we can offer some guarantees of high quality search performance. There are two schools of thought regarding how to control the topology of peer-to-peer networks. Using the structured a...
متن کاملHeuristics for Uninformed Search Algorithms in Unstructured P2P Networks Inspired by Self-Organizing Social Insect Models
We consider the problem of rapidly searching for resources or files in a distributed, unstructured, peer-to-peer file sharing network. Unstructured p2p network protocols such as Gnutella use a flooding-based mechanism for resource searching that generates considerable traffic in the network for each search query. When the searching activity by users in a p2p network is high, the traffic generat...
متن کاملSimple Heuristics as Equilibrium Strategies in Mutual Sequential Mate Search
In this paper, we study whether simple heuristics can arise as equilibrium strategies in mutual sequential mate search. To this aim, we extend the mate search model of Todd and Miller (1999), involving an adolescence (learning) phase followed by an actual mating phase, to a strategic game where the players, as the individuals in the mating population, choose before starting the adolescence phas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1976
ISSN: 0001-0782,1557-7317
DOI: 10.1145/359997.360000